An algorithm for multi-objective job shop scheduling problem

Authors

  • Mir B. Aryanezhad Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Mohammad Saidi Mehrabad Associate Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
  • Parviz Fattahi Ph.D. Candidate, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Abstract:

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we propose a Pareto approach to solve multi-objective job shop scheduling. The objective considered is to minimize the overall completion time (makespan) and total weighted tardiness (TWT). An effective simulated annealing algorithm based on proposed approach is presented to solve multi-objective job shop scheduling problems. An external memory of non-dominated solutions is considered to save and update the non-dominated solutions during the problem solving process. The parameters in the proposed algorithm are determined after conducting a pilot study. Numerical examples are used to evaluate and study the performance of the proposed algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

an algorithm for multi-objective job shop scheduling problem

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

full text

Single Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem

A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...

full text

An Improved Genetic Algorithm for Multi-objective Flexible Job-shop Scheduling Problem

Flexible job shop scheduling problem (FJSP) is an extended traditional job shop scheduling problem, which more approximates to real scheduling problems. This paper presents a multi-objective genetic algorithm (GA) based on immune and entropy principle to solve the multi-objective FJSP. In this improved multi-objective GA, the immune and entropy principle is used to keep the diversity of individ...

full text

A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...

full text

An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.021 * Corresponding author. E-mail address: [email protected] (X. Shao). Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the monoobjective FJSP. However, they are very d...

full text

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 3

pages  43- 53

publication date 2006-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023